Why the Rotation Count Algorithm Works
نویسندگان
چکیده
The characteristic functions of many affine jump-diffusion models, such as Heston’s stochastic volatility model and all of its extensions, involve multivalued functions such as the complex logarithm. If we restrict the logarithm to its principal branch, as is done in most software packages, the characteristic function can become discontinuous, leading to completely wrong option prices if options are priced by Fourier inversion. In this paper we prove under non-restrictive conditions on the parameters that the rotation count algorithm of Kahl and Jäckel chooses the correct branch of the complex logarithm. Under the same restrictions we prove that in an alternative formulation of the characteristic function the principal branch is the correct one. Seen as this formulation is easier to implement and numerically more stable than Heston’s formulation, it should be the preferred one. The remainder of this paper shows how complex discontinuities can be avoided in the Schöbel-Zhu model and the exact simulation algorithm of the Heston model, recently proposed by Broadie and Kaya. Finally, we show that Matytsin’s SVJJ model has a closed-form characteristic function, though the complex discontinuities that arise there due to the branch switching of the exponential integral cannot be avoided under all circumstances.
منابع مشابه
A cost-sensitive rotation forest algorithm for gene expression data classification
Existing works show that the rotation forest algorithm has competitive performance in terms of classification accuracy for gene expression data. However, most existing works only focus on the classification accuracy and neglect the classification costs. In this study, we propose a cost-sensitive rotation forest algorithm for gene expression data classification. Three classification costs, namel...
متن کاملA New RSTB Invariant Image Template Matching Based on Log-Spectrum and Modified ICA
Template matching is a widely used technique in many of image processing and machine vision applications. In this paper we propose a new as well as a fast and reliable template matching algorithm which is invariant to Rotation, Scale, Translation and Brightness (RSTB) changes. For this purpose, we adopt the idea of ring projection transform (RPT) of image. In the proposed algorithm, two novel s...
متن کاملSex-related Left Ventricle Rotational and Torsional Mechanics by Block Matching Algorithm
Background: The aim of the present study was to evaluate how left ventricular twist and torsion are associated with sex between sex groups of the same age.Materials and Methods: In this analytical study, twenty one healthy subjects were scanned in left ventricle basal and apical short axis views to run the block matching algorithm; instantaneous changes in the base and apex rotation angel...
متن کاملBQIABC: A new Quantum-Inspired Artificial Bee Colony Algorithm for Binary Optimization Problems
Artificial bee colony (ABC) algorithm is a swarm intelligence optimization algorithm inspired by the intelligent behavior of honey bees when searching for food sources. The various versions of the ABC algorithm have been widely used to solve continuous and discrete optimization problems in different fields. In this paper a new binary version of the ABC algorithm inspired by quantum computing, c...
متن کاملThe Nonlinear PCA Learning Rule and SignalSeparation - Mathematical Analysis
It has been veriied experimentally that nonlinear versions of the PCA network learning rules for the weights of a neural layer produce neurons that have signal separation capabilities. One of the learning rules earlier proposed by the author is studied here mathematically to analyze why and how the algorithm works in this application. It is shown that for input vectors whose density is symmetri...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006